-
1 ациклический орграф
Русско-английский словарь по электронике > ациклический орграф
-
2 ациклический орграф
Русско-английский словарь по радиоэлектронике > ациклический орграф
-
3 максимальный ациклический орграф
maximal acyclic мат., maximal acyclic digraphРусско-английский научно-технический словарь Масловского > максимальный ациклический орграф
-
4 ациклический орграф
Electronics: acyclic digraphУниверсальный русско-английский словарь > ациклический орграф
-
5 максимальный ациклический орграф
Mathematics: maximal acyclic digraphУниверсальный русско-английский словарь > максимальный ациклический орграф
См. также в других словарях:
Digraph (mathematics) — A directed graph or digraph G is an ordered pair G := (V, A) with * V is a set, whose elements are called vertices or nodes, * A is a set of ordered pairs of vertices, called directed edges, arcs, or arrows.It differs from an ordinary, undirected … Wikipedia
Directed acyclic graph — An example of a directed acyclic graph In mathematics and computer science, a directed acyclic graph (DAG i … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Directed graph — A directed graph. A directed graph or digraph is a pair G = (V,A) (sometimes G = (V,E)) of:[1] a set V, whose elements are called vertices or … Wikipedia
Glossary of order theory — This is a glossary of some terms used in various branches of mathematics that are related to the fields of order, lattice, and domain theory. Note that there is a structured list of order topics available as well. Other helpful resources might be … Wikipedia
Causal set theory bibliography — Main article: Causal Sets This Causal Set Theory Bibliography is intended to aid causal set research. It gathers together academic papers, books, talks and PhD theses related to causal set theory and is intended to help readers find references… … Wikipedia
Grafo acíclico dirigido — Un DAG simple. En ciencias de la computación y matemáticas un grafo acíclico dirigido (o gráfico dirigido acíclico) conocido como DAG por sus siglas en inglés, es un grafo dirigido que no tiene ciclos; esto significa que para cada vértice v, no… … Wikipedia Español
Cycle rank — In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Büchi (Eggan 1963). Intuitively, this concept measures how close a digraph is to a directed acyclic graph (DAG), in the sense that a … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
Список терминов — Список терминов, относящихся к алгоритмам и структурам данных Это сл … Википедия